Layered drawings of graphs with crossing constraintsFINOCCHI, Irene.Lecture notes in computer science. 2001, pp 357-367, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Sorting and Searching in Faulty MemoriesFINOCCHI, Irene; ITALIANO, Giuseppe F.Algorithmica. 2008, Vol 52, Num 3, pp 309-332, issn 0178-4617, 24 p.Article

Combinatorial algorithms for feedback problems in directed graphsDEMETRESCU, Camil; FINOCCHI, Irene.Information processing letters. 2003, Vol 86, Num 3, pp 129-136, issn 0020-0190, 8 p.Article

An experimental analysis of simple, distributed vertex coloring algorithmsFINOCCHI, Irene; PANCONESI, Alessandro; SILVESTRI, Riccardo et al.Algorithmica. 2005, Vol 41, Num 1, pp 1-23, issn 0178-4617, 23 p.Article

Optimal Resilient Sorting and Searching in the Presence of Memory FaultsFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2006, pp 286-298, issn 0302-9743, isbn 3-540-35904-4, 13 p.Conference Paper

Conflict-free star-access in parallel memory systemsDAS, Sajal K; FINOCCHI, Irene; PETRESCHI, Rossella et al.Journal of parallel and distributed computing (Print). 2006, Vol 66, Num 11, pp 1431-1441, issn 0743-7315, 11 p.Article

Designing reliable algorithms in unreliable memoriesFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2005, pp 1-8, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

On the validity of hierarchical decompositionsFINOCCHI, Irene; PETRESCHI, Rossella.Lecture notes in computer science. 2001, pp 368-374, issn 0302-9743, isbn 3-540-42494-6Conference Paper

Algorithms and complexity (6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006)Calamoneri, Tiziana; Finocchi, Irene; Italiano, Giuseppe F et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-34375-X, 1Vol, XII-394 p, isbn 3-540-34375-XConference Proceedings

Engineering and visualizing algorithmsDEMETRESCU, Camil; FINOCCHI, Irene; ITALIANO, Giuseppe F et al.Lecture notes in computer science. 2003, pp 509-513, issn 0302-9743, isbn 3-540-20831-3, 5 p.Conference Paper

Specifying algorithm visualizations: Interesting events or state mapping?DEMETRESCU, Camil; FINOCCHI, Irene; STASKO, John T et al.Lecture notes in computer science. 2002, pp 16-30, issn 0302-9743, isbn 3-540-43323-6Conference Paper

Visualizing algorithms over the Web with the publication-driven approachDEMETRESCU, Camil; FINOCCHI, Irene; LIOTTA, Giuseppe et al.Lecture notes in computer science. 2001, pp 147-158, issn 0302-9743, isbn 3-540-42512-8Conference Paper

A unified approach to coding labeled treesCAMINITI, Saverio; FINOCCHI, Irene; PETRESCHI, Rossella et al.Lecture notes in computer science. 2004, pp 339-348, issn 0302-9743, isbn 3-540-21258-2, 10 p.Conference Paper

Hierarchical clustering of trees : Algorithms and experimentsFINOCCHI, Irene; PETRESCHI, Rossella.Lecture notes in computer science. 2001, pp 117-131, issn 0302-9743, isbn 3-540-42560-8Conference Paper

Mining Hot Calling Contexts in Small SpaceCONO D'ELIA, Daniele; DEMETRESCU, Camil; FINOCCHI, Irene et al.ACM SIGPLAN notices. 2011, Vol 46, Num 6, pp 516-527, issn 1523-2867, 12 p.Conference Paper

Deciding the FIFO stability of networks in polynomial timeWEINARD, Maik.Lecture notes in computer science. 2006, pp 81-92, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Tighter approximation bounds for LPT scheduling in two special casesKOVACS, Annamaria.Lecture notes in computer science. 2006, pp 187-198, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Counting all solutions of minimum weight exact satisfiabilityPORSCHEN, Stefan.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 10 p.Conference Paper

On the hardness of range assignment problemsFUCHS, Bernhard.Lecture notes in computer science. 2006, pp 127-138, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

A near optimal scheduler for on-demand data broadcastsTING, Hing-Fung.Lecture notes in computer science. 2006, pp 163-174, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Fixed-parameter tractable generalizations of cluster editingDAMASCHKE, Peter.Lecture notes in computer science. 2006, pp 344-355, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

On broadcast scheduling with limited energyGUNIA, Christian.Lecture notes in computer science. 2006, pp 151-162, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is smallKULKARNI, Raghav.Lecture notes in computer science. 2006, pp 308-319, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Parameterized algorithms for HITTING SET : The weighted caseFERNAUL, Henning.Lecture notes in computer science. 2006, pp 332-343, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Optimal resilient sorting and searching in the presence of memory faultsFINOCCHI, Irene; GRANDONI, Fabrizio; ITALIANO, Giuseppe F et al.Theoretical computer science. 2009, Vol 410, Num 44, pp 4457-4470, issn 0304-3975, 14 p.Conference Paper